Boolean functions whose monotone complexity is of size n2log n
نویسندگان
چکیده
منابع مشابه
The monotone circuit complexity of Boolean functions
Recently, Razborov obtained superpolynomial lower bounds for monotone circuits that lect cliques in graphs. In particular, Razborov showed that detecting cliques of size s in a graph dh m vertices requires monotone circuits of size .Q(m-'/(log m) ~') for fixed s, and size rn ao°~') for ,. :[log ml4J. In this paper we modify the arguments of Razborov to obtain exponential lower bounds for ,moton...
متن کاملMinimizing the Average Query Complexity of Learning Monotone Boolean Functions
This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries. The minimum average query complexity is guaranteed via recursion, where partially ordered sets (posets) make up the overlapping subproblems. For problems with up to 4 variables, the posets’ optimality conditions are summarized in the form of an evaluative criterion. The...
متن کاملApproximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity
The Total Influence (Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function f : {0, 1}n → {0, 1}, which we denote by I[f ]. We present a randomized algorithm that approximates the influence of such functions to within a multiplicative factor of (1 ± ǫ) by performing O (√ n logn I[f ...
متن کاملInfluences of monotone Boolean functions
Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this short note is to prove this conjecture.
متن کاملCeilings of Monotone Boolean Functions
This paper considers a particular relationship defined over pairs of n-argument monotone Boolean functions. The relationship is of interest since we can show that if ( g, h ) satisfy it then for any n-argument monotone Boolean function f there is a close relationship between the combinational and monotone network complexities of the function (f /\ g) \/ h. We characterise the class of pairs of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1982
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90084-4